./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-nondet.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-theta/unwind3-nondet.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 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:53,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:53,297 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:57:53,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:53,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:53,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:53,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:53,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:53,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:53,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:53,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:53,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:53,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:53,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:53,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:53,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:53,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:53,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:53,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:53,317 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 -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2025-01-10 06:57:53,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:53,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:53,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:53,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:53,525 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:53,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-01-10 06:57:54,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1fbb9c6/2049cca25487404b85c0a878cd860596/FLAG2c1022609 [2025-01-10 06:57:55,040 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:55,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-01-10 06:57:55,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1fbb9c6/2049cca25487404b85c0a878cd860596/FLAG2c1022609 [2025-01-10 06:57:55,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1fbb9c6/2049cca25487404b85c0a878cd860596 [2025-01-10 06:57:55,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:55,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:55,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:55,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:55,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:55,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea24f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55, skipping insertion in model container [2025-01-10 06:57:55,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:55,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:55,539 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:55,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:55,588 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:55,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55 WrapperNode [2025-01-10 06:57:55,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:55,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:55,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:55,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:55,594 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:57:55" (1/1) ... [2025-01-10 06:57:55,602 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:57:55" (1/1) ... [2025-01-10 06:57:55,613 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-01-10 06:57:55,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:55,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:55,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:55,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:55,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:57:55,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:55,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:55,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:55,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:55,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (1/1) ... [2025-01-10 06:57:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:55,664 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:57:55,671 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:57:55,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:55,686 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:55,686 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:55,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:55,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:55,687 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:57:55,774 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:55,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:55,883 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:55,883 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:55,957 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:55,957 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:55,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:55 BoogieIcfgContainer [2025-01-10 06:57:55,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:55,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:55,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:55,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:55,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:55" (1/3) ... [2025-01-10 06:57:55,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e31a174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:55, skipping insertion in model container [2025-01-10 06:57:55,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:55" (2/3) ... [2025-01-10 06:57:55,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e31a174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:55, skipping insertion in model container [2025-01-10 06:57:55,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:55" (3/3) ... [2025-01-10 06:57:55,967 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2025-01-10 06:57:55,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:55,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-nondet.i that has 3 procedures, 32 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-01-10 06:57:55,982 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:56,029 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:56,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 74 flow [2025-01-10 06:57:56,077 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2025-01-10 06:57:56,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:56,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2025-01-10 06:57:56,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 74 flow [2025-01-10 06:57:56,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 71 flow [2025-01-10 06:57:56,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:56,114 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;@53605b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:56,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 06:57:56,122 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:56,122 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:57:56,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:56,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:56,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 530423467, now seen corresponding path program 1 times [2025-01-10 06:57:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607754417] [2025-01-10 06:57:56,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:56,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:56,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,346 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:57:56,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607754417] [2025-01-10 06:57:56,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607754417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:56,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:57:56,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840531770] [2025-01-10 06:57:56,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:56,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:56,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:56,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-01-10 06:57:56,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:56,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-01-10 06:57:56,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,660 INFO L124 PetriNetUnfolderBase]: 108/266 cut-off events. [2025-01-10 06:57:56,661 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:56,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 266 events. 108/266 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1236 event pairs, 23 based on Foata normal form. 20/258 useless extension candidates. Maximal degree in co-relation 431. Up to 82 conditions per place. [2025-01-10 06:57:56,664 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 46 selfloop transitions, 12 changer transitions 2/69 dead transitions. [2025-01-10 06:57:56,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 274 flow [2025-01-10 06:57:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:57:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:57:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2025-01-10 06:57:56,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-01-10 06:57:56,673 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 71 flow. Second operand 9 states and 156 transitions. [2025-01-10 06:57:56,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 274 flow [2025-01-10 06:57:56,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:56,682 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 142 flow [2025-01-10 06:57:56,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-01-10 06:57:56,690 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2025-01-10 06:57:56,690 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 142 flow [2025-01-10 06:57:56,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:56,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:56,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:56,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash -737598476, now seen corresponding path program 1 times [2025-01-10 06:57:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-01-10 06:57:56,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:56,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:56,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,755 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:57:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-01-10 06:57:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044953435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:56,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148033459] [2025-01-10 06:57:56,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:56,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:56,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 33 [2025-01-10 06:57:56,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:57:56,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 33 [2025-01-10 06:57:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,797 INFO L124 PetriNetUnfolderBase]: 53/168 cut-off events. [2025-01-10 06:57:56,797 INFO L125 PetriNetUnfolderBase]: For 47/48 co-relation queries the response was YES. [2025-01-10 06:57:56,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 168 events. 53/168 cut-off events. For 47/48 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 743 event pairs, 30 based on Foata normal form. 10/160 useless extension candidates. Maximal degree in co-relation 276. Up to 111 conditions per place. [2025-01-10 06:57:56,799 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 20 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-01-10 06:57:56,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 175 flow [2025-01-10 06:57:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-01-10 06:57:56,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2025-01-10 06:57:56,800 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 142 flow. Second operand 3 states and 67 transitions. [2025-01-10 06:57:56,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 175 flow [2025-01-10 06:57:56,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:56,805 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 132 flow [2025-01-10 06:57:56,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-01-10 06:57:56,806 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-01-10 06:57:56,806 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 132 flow [2025-01-10 06:57:56,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:57:56,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:56,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:56,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash -737598443, now seen corresponding path program 1 times [2025-01-10 06:57:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62943133] [2025-01-10 06:57:56,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:56,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:56,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62943133] [2025-01-10 06:57:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62943133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749902893] [2025-01-10 06:57:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:56,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:56,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:56,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 33 [2025-01-10 06:57:56,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:57:56,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:56,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 33 [2025-01-10 06:57:56,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:56,928 INFO L124 PetriNetUnfolderBase]: 85/256 cut-off events. [2025-01-10 06:57:56,929 INFO L125 PetriNetUnfolderBase]: For 34/35 co-relation queries the response was YES. [2025-01-10 06:57:56,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 256 events. 85/256 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1251 event pairs, 36 based on Foata normal form. 8/247 useless extension candidates. Maximal degree in co-relation 514. Up to 128 conditions per place. [2025-01-10 06:57:56,930 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 27 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-01-10 06:57:56,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 214 flow [2025-01-10 06:57:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-10 06:57:56,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2025-01-10 06:57:56,932 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 132 flow. Second operand 4 states and 95 transitions. [2025-01-10 06:57:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 214 flow [2025-01-10 06:57:56,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:56,933 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 153 flow [2025-01-10 06:57:56,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-01-10 06:57:56,934 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-01-10 06:57:56,934 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 153 flow [2025-01-10 06:57:56,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:57:56,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:56,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:56,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:56,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:56,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash -736741457, now seen corresponding path program 1 times [2025-01-10 06:57:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:56,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673138017] [2025-01-10 06:57:56,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:56,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:56,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:56,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:56,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:56,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,004 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:57:57,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673138017] [2025-01-10 06:57:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673138017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844221790] [2025-01-10 06:57:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:57,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:57,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-01-10 06:57:57,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:57:57,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-01-10 06:57:57,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,128 INFO L124 PetriNetUnfolderBase]: 94/258 cut-off events. [2025-01-10 06:57:57,129 INFO L125 PetriNetUnfolderBase]: For 136/147 co-relation queries the response was YES. [2025-01-10 06:57:57,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 258 events. 94/258 cut-off events. For 136/147 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1133 event pairs, 12 based on Foata normal form. 42/296 useless extension candidates. Maximal degree in co-relation 601. Up to 90 conditions per place. [2025-01-10 06:57:57,130 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 38 selfloop transitions, 5 changer transitions 3/58 dead transitions. [2025-01-10 06:57:57,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 318 flow [2025-01-10 06:57:57,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-01-10 06:57:57,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-01-10 06:57:57,133 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 153 flow. Second operand 5 states and 105 transitions. [2025-01-10 06:57:57,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 318 flow [2025-01-10 06:57:57,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 306 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:57,135 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 142 flow [2025-01-10 06:57:57,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2025-01-10 06:57:57,136 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2025-01-10 06:57:57,137 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 142 flow [2025-01-10 06:57:57,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:57:57,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:57:57,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-01-10 06:57:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash 651522066, now seen corresponding path program 1 times [2025-01-10 06:57:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438898715] [2025-01-10 06:57:57,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:57,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:57,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:57,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:57,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:57,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:57,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:57,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:57,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:57,164 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 06:57:57,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 06:57:57,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 06:57:57,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 06:57:57,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 06:57:57,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 06:57:57,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:57:57,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:57:57,169 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:57,169 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:57:57,187 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:57,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 126 flow [2025-01-10 06:57:57,201 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2025-01-10 06:57:57,201 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:57,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 75 events. 3/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 86. Up to 6 conditions per place. [2025-01-10 06:57:57,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 126 flow [2025-01-10 06:57:57,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 40 transitions, 93 flow [2025-01-10 06:57:57,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:57,203 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;@53605b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:57,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 06:57:57,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:57,208 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:57:57,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:57,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1891418450, now seen corresponding path program 1 times [2025-01-10 06:57:57,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073809276] [2025-01-10 06:57:57,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:57,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073809276] [2025-01-10 06:57:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073809276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:57:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427249928] [2025-01-10 06:57:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:57,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:57,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:57,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2025-01-10 06:57:57,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:57:57,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2025-01-10 06:57:57,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,353 INFO L124 PetriNetUnfolderBase]: 263/659 cut-off events. [2025-01-10 06:57:57,353 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:57:57,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 659 events. 263/659 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4114 event pairs, 180 based on Foata normal form. 3/571 useless extension candidates. Maximal degree in co-relation 389. Up to 440 conditions per place. [2025-01-10 06:57:57,357 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 23 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-01-10 06:57:57,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 157 flow [2025-01-10 06:57:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-01-10 06:57:57,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7044025157232704 [2025-01-10 06:57:57,359 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 93 flow. Second operand 3 states and 112 transitions. [2025-01-10 06:57:57,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 157 flow [2025-01-10 06:57:57,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:57,360 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 113 flow [2025-01-10 06:57:57,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-01-10 06:57:57,361 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-01-10 06:57:57,361 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 113 flow [2025-01-10 06:57:57,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:57:57,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:57:57,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1891418770, now seen corresponding path program 1 times [2025-01-10 06:57:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-01-10 06:57:57,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:57,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:57,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,421 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:57:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-01-10 06:57:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691770302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:57:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277583815] [2025-01-10 06:57:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:57,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:57,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 06:57:57,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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:57:57,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 06:57:57,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,804 INFO L124 PetriNetUnfolderBase]: 1208/2151 cut-off events. [2025-01-10 06:57:57,805 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-01-10 06:57:57,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 2151 events. 1208/2151 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12814 event pairs, 209 based on Foata normal form. 93/2104 useless extension candidates. Maximal degree in co-relation 2198. Up to 518 conditions per place. [2025-01-10 06:57:57,815 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 100 selfloop transitions, 17 changer transitions 1/131 dead transitions. [2025-01-10 06:57:57,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 131 transitions, 585 flow [2025-01-10 06:57:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2025-01-10 06:57:57,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2025-01-10 06:57:57,816 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 113 flow. Second operand 10 states and 310 transitions. [2025-01-10 06:57:57,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 131 transitions, 585 flow [2025-01-10 06:57:57,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 131 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:57,819 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 221 flow [2025-01-10 06:57:57,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-01-10 06:57:57,820 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2025-01-10 06:57:57,820 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 221 flow [2025-01-10 06:57:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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:57:57,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:57:57,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1496380248, now seen corresponding path program 1 times [2025-01-10 06:57:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578679955] [2025-01-10 06:57:57,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:57,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:57,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:57,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:57,858 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:57:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578679955] [2025-01-10 06:57:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578679955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:57,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827258666] [2025-01-10 06:57:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:57,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:57,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:57,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:57,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:57,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2025-01-10 06:57:57,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:57:57,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:57,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2025-01-10 06:57:57,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:57,975 INFO L124 PetriNetUnfolderBase]: 451/1171 cut-off events. [2025-01-10 06:57:57,975 INFO L125 PetriNetUnfolderBase]: For 500/521 co-relation queries the response was YES. [2025-01-10 06:57:57,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 1171 events. 451/1171 cut-off events. For 500/521 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8375 event pairs, 366 based on Foata normal form. 52/1069 useless extension candidates. Maximal degree in co-relation 2007. Up to 749 conditions per place. [2025-01-10 06:57:57,983 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 25 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2025-01-10 06:57:57,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 263 flow [2025-01-10 06:57:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 06:57:57,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2025-01-10 06:57:57,984 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 221 flow. Second operand 3 states and 100 transitions. [2025-01-10 06:57:57,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 263 flow [2025-01-10 06:57:57,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:57,990 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 209 flow [2025-01-10 06:57:57,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2025-01-10 06:57:57,991 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2025-01-10 06:57:57,991 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 209 flow [2025-01-10 06:57:57,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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:57:57,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:57,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:57,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:57:57,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1496380215, now seen corresponding path program 1 times [2025-01-10 06:57:57,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:57,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268270914] [2025-01-10 06:57:57,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:57,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:58,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:58,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,028 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:57:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268270914] [2025-01-10 06:57:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268270914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061577969] [2025-01-10 06:57:58,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:58,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:58,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 53 [2025-01-10 06:57:58,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57:58,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 53 [2025-01-10 06:57:58,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:58,206 INFO L124 PetriNetUnfolderBase]: 715/1785 cut-off events. [2025-01-10 06:57:58,206 INFO L125 PetriNetUnfolderBase]: For 453/474 co-relation queries the response was YES. [2025-01-10 06:57:58,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 1785 events. 715/1785 cut-off events. For 453/474 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13506 event pairs, 426 based on Foata normal form. 40/1624 useless extension candidates. Maximal degree in co-relation 3485. Up to 856 conditions per place. [2025-01-10 06:57:58,215 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 38 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-01-10 06:57:58,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 331 flow [2025-01-10 06:57:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-01-10 06:57:58,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7075471698113207 [2025-01-10 06:57:58,216 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 209 flow. Second operand 4 states and 150 transitions. [2025-01-10 06:57:58,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 331 flow [2025-01-10 06:57:58,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:58,220 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 230 flow [2025-01-10 06:57:58,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-01-10 06:57:58,221 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2025-01-10 06:57:58,221 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 230 flow [2025-01-10 06:57:58,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57:58,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:57:58,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:58,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1495559971, now seen corresponding path program 1 times [2025-01-10 06:57:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-01-10 06:57:58,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:57:58,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:57:58,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,258 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:57:58,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832913749] [2025-01-10 06:57:58,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832913749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341907536] [2025-01-10 06:57:58,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:58,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:58,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 06:57:58,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:58,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 06:57:58,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:58,528 INFO L124 PetriNetUnfolderBase]: 1087/2025 cut-off events. [2025-01-10 06:57:58,528 INFO L125 PetriNetUnfolderBase]: For 1751/1951 co-relation queries the response was YES. [2025-01-10 06:57:58,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5106 conditions, 2025 events. 1087/2025 cut-off events. For 1751/1951 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12326 event pairs, 198 based on Foata normal form. 256/2205 useless extension candidates. Maximal degree in co-relation 5089. Up to 945 conditions per place. [2025-01-10 06:57:58,537 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 70 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2025-01-10 06:57:58,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 533 flow [2025-01-10 06:57:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-01-10 06:57:58,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2025-01-10 06:57:58,538 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 230 flow. Second operand 6 states and 201 transitions. [2025-01-10 06:57:58,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 533 flow [2025-01-10 06:57:58,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 516 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:58,542 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 222 flow [2025-01-10 06:57:58,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2025-01-10 06:57:58,543 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2025-01-10 06:57:58,543 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 222 flow [2025-01-10 06:57:58,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:58,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:57:58,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:58,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1197099394, now seen corresponding path program 1 times [2025-01-10 06:57:58,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832498494] [2025-01-10 06:57:58,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:58,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:57:58,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:57:58,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:57:58,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832498494] [2025-01-10 06:57:58,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832498494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826152392] [2025-01-10 06:57:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:58,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:57:58,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 06:57:58,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:57:58,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 06:57:58,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:58,817 INFO L124 PetriNetUnfolderBase]: 1009/1839 cut-off events. [2025-01-10 06:57:58,817 INFO L125 PetriNetUnfolderBase]: For 1543/1644 co-relation queries the response was YES. [2025-01-10 06:57:58,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 1839 events. 1009/1839 cut-off events. For 1543/1644 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10859 event pairs, 296 based on Foata normal form. 5/1783 useless extension candidates. Maximal degree in co-relation 4814. Up to 1360 conditions per place. [2025-01-10 06:57:58,827 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 44 selfloop transitions, 9 changer transitions 6/74 dead transitions. [2025-01-10 06:57:58,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 417 flow [2025-01-10 06:57:58,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-01-10 06:57:58,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.559748427672956 [2025-01-10 06:57:58,830 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 222 flow. Second operand 6 states and 178 transitions. [2025-01-10 06:57:58,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 417 flow [2025-01-10 06:57:58,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 396 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:58,835 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 219 flow [2025-01-10 06:57:58,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2025-01-10 06:57:58,835 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2025-01-10 06:57:58,835 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 219 flow [2025-01-10 06:57:58,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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:57:58,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:58,836 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:58,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:57:58,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:58,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1739845131, now seen corresponding path program 1 times [2025-01-10 06:57:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:58,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137005938] [2025-01-10 06:57:58,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:58,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:58,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:57:58,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:57:58,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:58,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:58,906 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:57:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:58,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137005938] [2025-01-10 06:57:58,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137005938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:58,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:58,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:57:58,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039174] [2025-01-10 06:57:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:58,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:57:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:58,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:57:58,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:57:58,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 06:57:58,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:58,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:58,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 06:57:58,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,227 INFO L124 PetriNetUnfolderBase]: 1490/2690 cut-off events. [2025-01-10 06:57:59,227 INFO L125 PetriNetUnfolderBase]: For 1971/2115 co-relation queries the response was YES. [2025-01-10 06:57:59,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6843 conditions, 2690 events. 1490/2690 cut-off events. For 1971/2115 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17062 event pairs, 166 based on Foata normal form. 84/2712 useless extension candidates. Maximal degree in co-relation 6826. Up to 756 conditions per place. [2025-01-10 06:57:59,240 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 91 selfloop transitions, 15 changer transitions 0/119 dead transitions. [2025-01-10 06:57:59,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 119 transitions, 694 flow [2025-01-10 06:57:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:57:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:57:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 265 transitions. [2025-01-10 06:57:59,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-10 06:57:59,242 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 219 flow. Second operand 9 states and 265 transitions. [2025-01-10 06:57:59,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 119 transitions, 694 flow [2025-01-10 06:57:59,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 652 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-01-10 06:57:59,248 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 266 flow [2025-01-10 06:57:59,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=266, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2025-01-10 06:57:59,249 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2025-01-10 06:57:59,249 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 266 flow [2025-01-10 06:57:59,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:59,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:57:59,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:59,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1739845675, now seen corresponding path program 1 times [2025-01-10 06:57:59,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201652749] [2025-01-10 06:57:59,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:57:59,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:57:59,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,282 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:57:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201652749] [2025-01-10 06:57:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201652749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:59,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:59,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:59,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093832170] [2025-01-10 06:57:59,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:59,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:59,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:59,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:59,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2025-01-10 06:57:59,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57:59,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:59,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2025-01-10 06:57:59,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,404 INFO L124 PetriNetUnfolderBase]: 724/1594 cut-off events. [2025-01-10 06:57:59,405 INFO L125 PetriNetUnfolderBase]: For 712/717 co-relation queries the response was YES. [2025-01-10 06:57:59,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3733 conditions, 1594 events. 724/1594 cut-off events. For 712/717 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11507 event pairs, 384 based on Foata normal form. 21/1494 useless extension candidates. Maximal degree in co-relation 3716. Up to 951 conditions per place. [2025-01-10 06:57:59,416 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 31 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-01-10 06:57:59,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 360 flow [2025-01-10 06:57:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 06:57:59,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6650943396226415 [2025-01-10 06:57:59,421 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 266 flow. Second operand 4 states and 141 transitions. [2025-01-10 06:57:59,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 360 flow [2025-01-10 06:57:59,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 62 transitions, 352 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:59,424 INFO L231 Difference]: Finished difference. Result has 74 places, 54 transitions, 264 flow [2025-01-10 06:57:59,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2025-01-10 06:57:59,424 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2025-01-10 06:57:59,424 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 264 flow [2025-01-10 06:57:59,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57:59,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,424 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:57:59,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:59,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1899359209, now seen corresponding path program 1 times [2025-01-10 06:57:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-01-10 06:57:59,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:59,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:59,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,461 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:57:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-01-10 06:57:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211908299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:59,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150333911] [2025-01-10 06:57:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:59,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:59,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:59,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:59,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:59,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2025-01-10 06:57:59,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 54 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57:59,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:59,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2025-01-10 06:57:59,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,598 INFO L124 PetriNetUnfolderBase]: 698/1535 cut-off events. [2025-01-10 06:57:59,598 INFO L125 PetriNetUnfolderBase]: For 603/608 co-relation queries the response was YES. [2025-01-10 06:57:59,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3513 conditions, 1535 events. 698/1535 cut-off events. For 603/608 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11155 event pairs, 330 based on Foata normal form. 1/1462 useless extension candidates. Maximal degree in co-relation 3495. Up to 1043 conditions per place. [2025-01-10 06:57:59,604 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 31 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2025-01-10 06:57:59,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 63 transitions, 370 flow [2025-01-10 06:57:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-01-10 06:57:59,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6698113207547169 [2025-01-10 06:57:59,605 INFO L175 Difference]: Start difference. First operand has 74 places, 54 transitions, 264 flow. Second operand 4 states and 142 transitions. [2025-01-10 06:57:59,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 63 transitions, 370 flow [2025-01-10 06:57:59,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 63 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:57:59,609 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 278 flow [2025-01-10 06:57:59,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2025-01-10 06:57:59,609 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2025-01-10 06:57:59,609 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 278 flow [2025-01-10 06:57:59,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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:57:59,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:57:59,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:59,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1899376097, now seen corresponding path program 1 times [2025-01-10 06:57:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061541121] [2025-01-10 06:57:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:59,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:59,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061541121] [2025-01-10 06:57:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061541121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849027466] [2025-01-10 06:57:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:59,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:57:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:59,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:57:59,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:57:59,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-01-10 06:57:59,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:59,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:59,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-01-10 06:57:59,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:59,855 INFO L124 PetriNetUnfolderBase]: 1254/2310 cut-off events. [2025-01-10 06:57:59,855 INFO L125 PetriNetUnfolderBase]: For 2592/2728 co-relation queries the response was YES. [2025-01-10 06:57:59,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 2310 events. 1254/2310 cut-off events. For 2592/2728 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14537 event pairs, 234 based on Foata normal form. 76/2360 useless extension candidates. Maximal degree in co-relation 6347. Up to 1142 conditions per place. [2025-01-10 06:57:59,866 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 72 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2025-01-10 06:57:59,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 607 flow [2025-01-10 06:57:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-01-10 06:57:59,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2025-01-10 06:57:59,868 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 278 flow. Second operand 6 states and 196 transitions. [2025-01-10 06:57:59,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 607 flow [2025-01-10 06:57:59,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 580 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:59,876 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 275 flow [2025-01-10 06:57:59,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2025-01-10 06:57:59,877 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2025-01-10 06:57:59,877 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 275 flow [2025-01-10 06:57:59,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:59,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,877 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:57:59,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-01-10 06:57:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -76891377, now seen corresponding path program 1 times [2025-01-10 06:57:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273274367] [2025-01-10 06:57:59,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:59,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:59,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:59,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:57:59,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:57:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:57:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:57:59,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:57:59,896 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:57:59,896 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-01-10 06:57:59,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-01-10 06:57:59,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:57:59,897 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,898 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:57:59,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:57:59,921 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:57:59,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 182 flow [2025-01-10 06:57:59,927 INFO L124 PetriNetUnfolderBase]: 4/103 cut-off events. [2025-01-10 06:57:59,927 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:57:59,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 103 events. 4/103 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 338 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 120. Up to 8 conditions per place. [2025-01-10 06:57:59,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 182 flow [2025-01-10 06:57:59,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 117 flow [2025-01-10 06:57:59,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:59,929 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;@53605b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:59,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-10 06:57:59,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:59,930 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:57:59,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:59,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:59,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:59,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:57:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash 119320781, now seen corresponding path program 1 times [2025-01-10 06:57:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:59,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683914700] [2025-01-10 06:57:59,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:59,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:59,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:59,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:59,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683914700] [2025-01-10 06:57:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683914700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:59,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:57:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443377090] [2025-01-10 06:57:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:59,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:59,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:59,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:58:00,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-01-10 06:58:00,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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:58:00,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:00,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-01-10 06:58:00,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:00,740 INFO L124 PetriNetUnfolderBase]: 8710/13509 cut-off events. [2025-01-10 06:58:00,740 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-01-10 06:58:00,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26436 conditions, 13509 events. 8710/13509 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 92338 event pairs, 1571 based on Foata normal form. 400/12753 useless extension candidates. Maximal degree in co-relation 8332. Up to 4536 conditions per place. [2025-01-10 06:58:00,789 INFO L140 encePairwiseOnDemand]: 58/73 looper letters, 119 selfloop transitions, 20 changer transitions 1/157 dead transitions. [2025-01-10 06:58:00,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 157 transitions, 668 flow [2025-01-10 06:58:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:58:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:58:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 427 transitions. [2025-01-10 06:58:00,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584931506849315 [2025-01-10 06:58:00,792 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 117 flow. Second operand 10 states and 427 transitions. [2025-01-10 06:58:00,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 157 transitions, 668 flow [2025-01-10 06:58:00,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 157 transitions, 652 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:00,794 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 269 flow [2025-01-10 06:58:00,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=269, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-01-10 06:58:00,795 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-01-10 06:58:00,795 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 269 flow [2025-01-10 06:58:00,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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:58:00,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:00,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:00,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:58:00,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:00,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash -596798286, now seen corresponding path program 1 times [2025-01-10 06:58:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:00,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-01-10 06:58:00,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:00,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:58:00,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:58:00,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:00,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:00,820 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:58:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-01-10 06:58:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395525240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:58:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717716113] [2025-01-10 06:58:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:00,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:58:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:00,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:58:00,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:58:00,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 73 [2025-01-10 06:58:00,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:00,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:00,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 73 [2025-01-10 06:58:00,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:01,169 INFO L124 PetriNetUnfolderBase]: 3146/6854 cut-off events. [2025-01-10 06:58:01,169 INFO L125 PetriNetUnfolderBase]: For 2458/3038 co-relation queries the response was YES. [2025-01-10 06:58:01,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13944 conditions, 6854 events. 3146/6854 cut-off events. For 2458/3038 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 62847 event pairs, 2643 based on Foata normal form. 214/5912 useless extension candidates. Maximal degree in co-relation 11947. Up to 4290 conditions per place. [2025-01-10 06:58:01,201 INFO L140 encePairwiseOnDemand]: 71/73 looper letters, 27 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2025-01-10 06:58:01,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 66 transitions, 315 flow [2025-01-10 06:58:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:58:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:58:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-01-10 06:58:01,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6073059360730594 [2025-01-10 06:58:01,202 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 269 flow. Second operand 3 states and 133 transitions. [2025-01-10 06:58:01,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 66 transitions, 315 flow [2025-01-10 06:58:01,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:01,208 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 256 flow [2025-01-10 06:58:01,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-01-10 06:58:01,209 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-01-10 06:58:01,209 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 256 flow [2025-01-10 06:58:01,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:01,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:01,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:58:01,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:01,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash -596798253, now seen corresponding path program 1 times [2025-01-10 06:58:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:01,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850821825] [2025-01-10 06:58:01,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:01,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:58:01,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:58:01,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:01,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850821825] [2025-01-10 06:58:01,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850821825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:01,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:01,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:01,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299288930] [2025-01-10 06:58:01,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:01,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:01,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:01,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:01,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:01,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-01-10 06:58:01,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:58:01,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:01,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-01-10 06:58:01,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:01,801 INFO L124 PetriNetUnfolderBase]: 4894/10368 cut-off events. [2025-01-10 06:58:01,802 INFO L125 PetriNetUnfolderBase]: For 2158/2740 co-relation queries the response was YES. [2025-01-10 06:58:01,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20207 conditions, 10368 events. 4894/10368 cut-off events. For 2158/2740 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 98974 event pairs, 3055 based on Foata normal form. 210/9139 useless extension candidates. Maximal degree in co-relation 20191. Up to 4901 conditions per place. [2025-01-10 06:58:01,854 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 44 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-01-10 06:58:01,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 85 transitions, 398 flow [2025-01-10 06:58:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-01-10 06:58:01,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.702054794520548 [2025-01-10 06:58:01,856 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 256 flow. Second operand 4 states and 205 transitions. [2025-01-10 06:58:01,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 85 transitions, 398 flow [2025-01-10 06:58:01,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 85 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:01,864 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 277 flow [2025-01-10 06:58:01,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2025-01-10 06:58:01,865 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2025-01-10 06:58:01,865 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 277 flow [2025-01-10 06:58:01,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:58:01,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:01,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:01,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:58:01,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:01,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -596022695, now seen corresponding path program 1 times [2025-01-10 06:58:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-01-10 06:58:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:01,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:58:01,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:58:01,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:01,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:01,900 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:58:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-01-10 06:58:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116298231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:01,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:01,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:01,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260005951] [2025-01-10 06:58:01,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:01,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:01,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:01,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:01,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-01-10 06:58:01,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:58:01,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:01,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-01-10 06:58:01,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:02,735 INFO L124 PetriNetUnfolderBase]: 8185/12652 cut-off events. [2025-01-10 06:58:02,736 INFO L125 PetriNetUnfolderBase]: For 10185/12266 co-relation queries the response was YES. [2025-01-10 06:58:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32379 conditions, 12652 events. 8185/12652 cut-off events. For 10185/12266 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 83986 event pairs, 1797 based on Foata normal form. 1248/13483 useless extension candidates. Maximal degree in co-relation 32361. Up to 6337 conditions per place. [2025-01-10 06:58:02,818 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 89 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2025-01-10 06:58:02,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 119 transitions, 675 flow [2025-01-10 06:58:02,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-01-10 06:58:02,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187214611872146 [2025-01-10 06:58:02,823 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 277 flow. Second operand 6 states and 271 transitions. [2025-01-10 06:58:02,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 119 transitions, 675 flow [2025-01-10 06:58:02,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 657 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:02,892 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 272 flow [2025-01-10 06:58:02,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2025-01-10 06:58:02,893 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2025-01-10 06:58:02,893 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 272 flow [2025-01-10 06:58:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:58:02,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:02,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:02,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:58:02,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1948272090, now seen corresponding path program 1 times [2025-01-10 06:58:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:02,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-01-10 06:58:02,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:02,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:02,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:58:02,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:58:02,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:02,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:58:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:02,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-01-10 06:58:02,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528047602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:02,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:58:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532969045] [2025-01-10 06:58:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:58:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:02,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:58:02,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:58:02,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:58:02,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 272 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:58:02,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:02,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:58:02,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:03,594 INFO L124 PetriNetUnfolderBase]: 7603/12425 cut-off events. [2025-01-10 06:58:03,595 INFO L125 PetriNetUnfolderBase]: For 8872/9446 co-relation queries the response was YES. [2025-01-10 06:58:03,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31678 conditions, 12425 events. 7603/12425 cut-off events. For 8872/9446 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 90276 event pairs, 2393 based on Foata normal form. 5/11797 useless extension candidates. Maximal degree in co-relation 31660. Up to 10200 conditions per place. [2025-01-10 06:58:03,652 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 53 selfloop transitions, 11 changer transitions 6/89 dead transitions. [2025-01-10 06:58:03,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 89 transitions, 504 flow [2025-01-10 06:58:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2025-01-10 06:58:03,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.545662100456621 [2025-01-10 06:58:03,653 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 272 flow. Second operand 6 states and 239 transitions. [2025-01-10 06:58:03,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 89 transitions, 504 flow [2025-01-10 06:58:03,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 485 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:03,680 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 277 flow [2025-01-10 06:58:03,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=73, 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=277, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2025-01-10 06:58:03,680 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2025-01-10 06:58:03,681 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 277 flow [2025-01-10 06:58:03,681 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:58:03,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:03,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:03,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:58:03,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1405924054, now seen corresponding path program 1 times [2025-01-10 06:58:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011597085] [2025-01-10 06:58:03,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:03,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:58:03,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:58:03,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:03,703 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:58:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011597085] [2025-01-10 06:58:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011597085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:58:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146613893] [2025-01-10 06:58:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:58:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:58:03,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:58:03,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-01-10 06:58:03,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:58:03,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:03,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-01-10 06:58:03,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:04,132 INFO L124 PetriNetUnfolderBase]: 4378/9310 cut-off events. [2025-01-10 06:58:04,133 INFO L125 PetriNetUnfolderBase]: For 3609/3883 co-relation queries the response was YES. [2025-01-10 06:58:04,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20039 conditions, 9310 events. 4378/9310 cut-off events. For 3609/3883 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 88697 event pairs, 3753 based on Foata normal form. 3/7934 useless extension candidates. Maximal degree in co-relation 20020. Up to 5971 conditions per place. [2025-01-10 06:58:04,170 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 29 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-01-10 06:58:04,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 67 transitions, 353 flow [2025-01-10 06:58:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:58:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:58:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-01-10 06:58:04,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2025-01-10 06:58:04,171 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 277 flow. Second operand 3 states and 150 transitions. [2025-01-10 06:58:04,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 67 transitions, 353 flow [2025-01-10 06:58:04,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 67 transitions, 325 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 06:58:04,180 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 273 flow [2025-01-10 06:58:04,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-01-10 06:58:04,181 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-01-10 06:58:04,182 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 273 flow [2025-01-10 06:58:04,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:58:04,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:04,182 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:04,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:58:04,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:04,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1291125995, now seen corresponding path program 1 times [2025-01-10 06:58:04,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-01-10 06:58:04,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:04,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:04,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:58:04,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:58:04,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:04,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:04,230 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:58:04,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-01-10 06:58:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698821941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:04,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:58:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571207836] [2025-01-10 06:58:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:04,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:58:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:04,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:58:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:58:04,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-01-10 06:58:04,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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:58:04,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:04,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-01-10 06:58:04,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:05,706 INFO L124 PetriNetUnfolderBase]: 15562/25129 cut-off events. [2025-01-10 06:58:05,707 INFO L125 PetriNetUnfolderBase]: For 15119/16416 co-relation queries the response was YES. [2025-01-10 06:58:05,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62740 conditions, 25129 events. 15562/25129 cut-off events. For 15119/16416 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 199197 event pairs, 3359 based on Foata normal form. 641/24898 useless extension candidates. Maximal degree in co-relation 62723. Up to 8597 conditions per place. [2025-01-10 06:58:05,860 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 116 selfloop transitions, 23 changer transitions 0/156 dead transitions. [2025-01-10 06:58:05,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 156 transitions, 942 flow [2025-01-10 06:58:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:58:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:58:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 368 transitions. [2025-01-10 06:58:05,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5601217656012176 [2025-01-10 06:58:05,862 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 273 flow. Second operand 9 states and 368 transitions. [2025-01-10 06:58:05,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 156 transitions, 942 flow [2025-01-10 06:58:05,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 156 transitions, 908 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:05,930 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 419 flow [2025-01-10 06:58:05,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=419, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2025-01-10 06:58:05,930 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2025-01-10 06:58:05,930 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 419 flow [2025-01-10 06:58:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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:58:05,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:05,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:05,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:58:05,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:05,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1291126315, now seen corresponding path program 1 times [2025-01-10 06:58:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795075642] [2025-01-10 06:58:05,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:05,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:58:05,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:58:05,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:05,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:58:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795075642] [2025-01-10 06:58:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795075642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515414845] [2025-01-10 06:58:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:05,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:05,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:05,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:05,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-01-10 06:58:05,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:58:05,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:05,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-01-10 06:58:05,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:06,611 INFO L124 PetriNetUnfolderBase]: 6777/13281 cut-off events. [2025-01-10 06:58:06,611 INFO L125 PetriNetUnfolderBase]: For 4820/4966 co-relation queries the response was YES. [2025-01-10 06:58:06,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29772 conditions, 13281 events. 6777/13281 cut-off events. For 4820/4966 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 128243 event pairs, 3154 based on Foata normal form. 206/11969 useless extension candidates. Maximal degree in co-relation 29751. Up to 7924 conditions per place. [2025-01-10 06:58:06,679 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 36 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-01-10 06:58:06,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 525 flow [2025-01-10 06:58:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-01-10 06:58:06,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643835616438356 [2025-01-10 06:58:06,682 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 419 flow. Second operand 4 states and 194 transitions. [2025-01-10 06:58:06,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 525 flow [2025-01-10 06:58:06,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 517 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:58:06,717 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 415 flow [2025-01-10 06:58:06,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2025-01-10 06:58:06,717 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2025-01-10 06:58:06,717 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 415 flow [2025-01-10 06:58:06,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:58:06,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:06,718 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:06,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:58:06,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:06,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1370209742, now seen corresponding path program 1 times [2025-01-10 06:58:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-01-10 06:58:06,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:06,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:58:06,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:58:06,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:06,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:58:06,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:06,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-01-10 06:58:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342137267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:06,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:06,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:58:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708350996] [2025-01-10 06:58:06,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:06,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:58:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:06,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:58:06,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:58:06,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 73 [2025-01-10 06:58:06,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:58:06,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:06,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 73 [2025-01-10 06:58:06,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:07,344 INFO L124 PetriNetUnfolderBase]: 6944/13050 cut-off events. [2025-01-10 06:58:07,344 INFO L125 PetriNetUnfolderBase]: For 4469/4713 co-relation queries the response was YES. [2025-01-10 06:58:07,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29440 conditions, 13050 events. 6944/13050 cut-off events. For 4469/4713 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 124596 event pairs, 4359 based on Foata normal form. 69/11840 useless extension candidates. Maximal degree in co-relation 29418. Up to 10067 conditions per place. [2025-01-10 06:58:07,424 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 37 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2025-01-10 06:58:07,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 545 flow [2025-01-10 06:58:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:58:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:58:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-01-10 06:58:07,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6712328767123288 [2025-01-10 06:58:07,425 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 415 flow. Second operand 4 states and 196 transitions. [2025-01-10 06:58:07,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 545 flow [2025-01-10 06:58:07,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 88 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:58:07,449 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 443 flow [2025-01-10 06:58:07,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=443, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2025-01-10 06:58:07,450 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2025-01-10 06:58:07,450 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 443 flow [2025-01-10 06:58:07,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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:58:07,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:07,450 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:07,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:58:07,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:07,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1370199805, now seen corresponding path program 1 times [2025-01-10 06:58:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-01-10 06:58:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:07,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:58:07,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:58:07,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:07,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-01-10 06:58:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468582968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470690095] [2025-01-10 06:58:07,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:07,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:07,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:07,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:07,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:58:07,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:58:07,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:58:07,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:07,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:07,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:58:07,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:07,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470690095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:07,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:07,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 06:58:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758736812] [2025-01-10 06:58:07,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:07,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:58:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:07,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:58:07,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:58:07,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-01-10 06:58:07,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 443 flow. Second operand has 9 states, 9 states have (on average 32.22222222222222) internal successors, (290), 9 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:07,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:07,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-01-10 06:58:07,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:09,061 INFO L124 PetriNetUnfolderBase]: 16329/25684 cut-off events. [2025-01-10 06:58:09,061 INFO L125 PetriNetUnfolderBase]: For 27982/30850 co-relation queries the response was YES. [2025-01-10 06:58:09,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70661 conditions, 25684 events. 16329/25684 cut-off events. For 27982/30850 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 197011 event pairs, 2139 based on Foata normal form. 685/26249 useless extension candidates. Maximal degree in co-relation 70638. Up to 8891 conditions per place. [2025-01-10 06:58:09,184 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 136 selfloop transitions, 20 changer transitions 0/174 dead transitions. [2025-01-10 06:58:09,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 174 transitions, 1183 flow [2025-01-10 06:58:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:58:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:58:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 358 transitions. [2025-01-10 06:58:09,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.613013698630137 [2025-01-10 06:58:09,188 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 443 flow. Second operand 8 states and 358 transitions. [2025-01-10 06:58:09,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 174 transitions, 1183 flow [2025-01-10 06:58:09,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 174 transitions, 1152 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-10 06:58:09,388 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 474 flow [2025-01-10 06:58:09,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=474, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2025-01-10 06:58:09,389 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2025-01-10 06:58:09,389 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 474 flow [2025-01-10 06:58:09,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.22222222222222) internal successors, (290), 9 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:09,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:09,389 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:09,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:58:09,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 06:58:09,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:09,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1893867728, now seen corresponding path program 1 times [2025-01-10 06:58:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:09,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-01-10 06:58:09,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:09,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:58:09,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:58:09,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:09,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:58:09,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:09,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-01-10 06:58:09,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889697603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:09,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:09,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:58:09,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786698045] [2025-01-10 06:58:09,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:09,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:58:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:09,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:58:09,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:58:09,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2025-01-10 06:58:09,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 474 flow. Second operand has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 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:58:09,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:09,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2025-01-10 06:58:09,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:12,051 INFO L124 PetriNetUnfolderBase]: 25611/39021 cut-off events. [2025-01-10 06:58:12,052 INFO L125 PetriNetUnfolderBase]: For 57329/59551 co-relation queries the response was YES. [2025-01-10 06:58:12,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114734 conditions, 39021 events. 25611/39021 cut-off events. For 57329/59551 co-relation queries the response was YES. Maximal size of possible extension queue 1931. Compared 302687 event pairs, 5416 based on Foata normal form. 284/38288 useless extension candidates. Maximal degree in co-relation 114709. Up to 19178 conditions per place. [2025-01-10 06:58:12,272 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 192 selfloop transitions, 36 changer transitions 0/244 dead transitions. [2025-01-10 06:58:12,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 244 transitions, 1756 flow [2025-01-10 06:58:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:58:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:58:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 517 transitions. [2025-01-10 06:58:12,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5447839831401475 [2025-01-10 06:58:12,274 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 474 flow. Second operand 13 states and 517 transitions. [2025-01-10 06:58:12,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 244 transitions, 1756 flow [2025-01-10 06:58:12,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 244 transitions, 1706 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:58:12,939 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 717 flow [2025-01-10 06:58:12,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=717, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2025-01-10 06:58:12,940 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 48 predicate places. [2025-01-10 06:58:12,940 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 717 flow [2025-01-10 06:58:12,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 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:58:12,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:12,940 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:12,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:58:12,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:12,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1601121032, now seen corresponding path program 2 times [2025-01-10 06:58:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:12,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416137704] [2025-01-10 06:58:12,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:58:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:12,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:58:12,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 16 statements. [2025-01-10 06:58:12,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:58:12,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:58:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:12,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416137704] [2025-01-10 06:58:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416137704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:58:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565017852] [2025-01-10 06:58:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:12,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:58:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:12,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:58:12,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:58:13,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 73 [2025-01-10 06:58:13,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 717 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 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:58:13,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:13,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 73 [2025-01-10 06:58:13,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:16,223 INFO L124 PetriNetUnfolderBase]: 31416/49311 cut-off events. [2025-01-10 06:58:16,224 INFO L125 PetriNetUnfolderBase]: For 96141/101180 co-relation queries the response was YES. [2025-01-10 06:58:16,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144710 conditions, 49311 events. 31416/49311 cut-off events. For 96141/101180 co-relation queries the response was YES. Maximal size of possible extension queue 2356. Compared 410663 event pairs, 6044 based on Foata normal form. 400/48764 useless extension candidates. Maximal degree in co-relation 144683. Up to 16484 conditions per place. [2025-01-10 06:58:16,519 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 159 selfloop transitions, 41 changer transitions 0/217 dead transitions. [2025-01-10 06:58:16,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 217 transitions, 1762 flow [2025-01-10 06:58:16,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:58:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:58:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 393 transitions. [2025-01-10 06:58:16,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672945205479452 [2025-01-10 06:58:16,521 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 717 flow. Second operand 8 states and 393 transitions. [2025-01-10 06:58:16,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 217 transitions, 1762 flow [2025-01-10 06:58:17,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 217 transitions, 1733 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 06:58:17,810 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 942 flow [2025-01-10 06:58:17,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=942, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2025-01-10 06:58:17,811 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 53 predicate places. [2025-01-10 06:58:17,811 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 942 flow [2025-01-10 06:58:17,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 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:58:17,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:17,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:17,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:58:17,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash -252834920, now seen corresponding path program 1 times [2025-01-10 06:58:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303699264] [2025-01-10 06:58:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:17,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:58:17,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:58:17,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:17,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:58:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:17,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303699264] [2025-01-10 06:58:17,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303699264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:17,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:17,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:58:17,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647159618] [2025-01-10 06:58:17,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:17,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:58:17,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:17,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:58:17,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:58:17,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2025-01-10 06:58:17,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 942 flow. Second operand has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 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:58:17,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:17,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2025-01-10 06:58:17,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:21,425 INFO L124 PetriNetUnfolderBase]: 28467/43879 cut-off events. [2025-01-10 06:58:21,426 INFO L125 PetriNetUnfolderBase]: For 129034/131764 co-relation queries the response was YES. [2025-01-10 06:58:21,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144711 conditions, 43879 events. 28467/43879 cut-off events. For 129034/131764 co-relation queries the response was YES. Maximal size of possible extension queue 2189. Compared 351847 event pairs, 6133 based on Foata normal form. 480/43567 useless extension candidates. Maximal degree in co-relation 144680. Up to 17498 conditions per place. [2025-01-10 06:58:21,704 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 192 selfloop transitions, 51 changer transitions 0/260 dead transitions. [2025-01-10 06:58:21,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 260 transitions, 2200 flow [2025-01-10 06:58:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:58:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:58:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 480 transitions. [2025-01-10 06:58:21,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.547945205479452 [2025-01-10 06:58:21,706 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 942 flow. Second operand 12 states and 480 transitions. [2025-01-10 06:58:21,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 260 transitions, 2200 flow [2025-01-10 06:58:23,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 260 transitions, 2174 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:23,512 INFO L231 Difference]: Finished difference. Result has 123 places, 123 transitions, 1168 flow [2025-01-10 06:58:23,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1168, PETRI_PLACES=123, PETRI_TRANSITIONS=123} [2025-01-10 06:58:23,513 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places. [2025-01-10 06:58:23,513 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 123 transitions, 1168 flow [2025-01-10 06:58:23,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 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:58:23,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:23,513 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:23,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:58:23,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:23,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1939018401, now seen corresponding path program 1 times [2025-01-10 06:58:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:23,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405512241] [2025-01-10 06:58:23,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:58:23,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:58:23,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:23,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:58:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405512241] [2025-01-10 06:58:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405512241] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603397263] [2025-01-10 06:58:23,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:23,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:23,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:23,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:23,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:58:23,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:58:23,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:58:23,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:23,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:23,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:58:23,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:58:23,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:58:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603397263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:23,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:58:23,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:58:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577324971] [2025-01-10 06:58:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:23,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:58:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:23,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:58:23,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:58:23,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-01-10 06:58:23,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 123 transitions, 1168 flow. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 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:58:23,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:23,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-01-10 06:58:23,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:25,325 INFO L124 PetriNetUnfolderBase]: 13734/26687 cut-off events. [2025-01-10 06:58:25,325 INFO L125 PetriNetUnfolderBase]: For 34354/36203 co-relation queries the response was YES. [2025-01-10 06:58:25,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67334 conditions, 26687 events. 13734/26687 cut-off events. For 34354/36203 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 285335 event pairs, 3343 based on Foata normal form. 901/25372 useless extension candidates. Maximal degree in co-relation 67300. Up to 5406 conditions per place. [2025-01-10 06:58:25,474 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 79 selfloop transitions, 5 changer transitions 0/171 dead transitions. [2025-01-10 06:58:25,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 171 transitions, 1578 flow [2025-01-10 06:58:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:58:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:58:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 299 transitions. [2025-01-10 06:58:25,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.682648401826484 [2025-01-10 06:58:25,638 INFO L175 Difference]: Start difference. First operand has 123 places, 123 transitions, 1168 flow. Second operand 6 states and 299 transitions. [2025-01-10 06:58:25,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 171 transitions, 1578 flow [2025-01-10 06:58:25,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 171 transitions, 1495 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-01-10 06:58:25,834 INFO L231 Difference]: Finished difference. Result has 120 places, 122 transitions, 1099 flow [2025-01-10 06:58:25,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1099, PETRI_PLACES=120, PETRI_TRANSITIONS=122} [2025-01-10 06:58:25,838 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 63 predicate places. [2025-01-10 06:58:25,838 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 122 transitions, 1099 flow [2025-01-10 06:58:25,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 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:58:25,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:25,838 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:25,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:58:26,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:26,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:26,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:26,044 INFO L85 PathProgramCache]: Analyzing trace with hash 164821166, now seen corresponding path program 1 times [2025-01-10 06:58:26,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:26,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107044968] [2025-01-10 06:58:26,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:26,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:26,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:26,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:26,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:58:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107044968] [2025-01-10 06:58:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107044968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:58:26,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:58:26,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:58:26,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471457751] [2025-01-10 06:58:26,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:58:26,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:58:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:26,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:58:26,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:58:26,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-01-10 06:58:26,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 122 transitions, 1099 flow. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:26,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:26,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-01-10 06:58:26,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:30,877 INFO L124 PetriNetUnfolderBase]: 39326/64292 cut-off events. [2025-01-10 06:58:30,878 INFO L125 PetriNetUnfolderBase]: For 210225/214065 co-relation queries the response was YES. [2025-01-10 06:58:31,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207849 conditions, 64292 events. 39326/64292 cut-off events. For 210225/214065 co-relation queries the response was YES. Maximal size of possible extension queue 3298. Compared 594325 event pairs, 19549 based on Foata normal form. 1622/64498 useless extension candidates. Maximal degree in co-relation 207815. Up to 24113 conditions per place. [2025-01-10 06:58:31,343 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 164 selfloop transitions, 100 changer transitions 0/297 dead transitions. [2025-01-10 06:58:31,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 297 transitions, 3145 flow [2025-01-10 06:58:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:58:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:58:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 480 transitions. [2025-01-10 06:58:31,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.547945205479452 [2025-01-10 06:58:31,344 INFO L175 Difference]: Start difference. First operand has 120 places, 122 transitions, 1099 flow. Second operand 12 states and 480 transitions. [2025-01-10 06:58:31,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 297 transitions, 3145 flow [2025-01-10 06:58:33,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 297 transitions, 3091 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-10 06:58:33,816 INFO L231 Difference]: Finished difference. Result has 135 places, 199 transitions, 2471 flow [2025-01-10 06:58:33,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2471, PETRI_PLACES=135, PETRI_TRANSITIONS=199} [2025-01-10 06:58:33,817 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 78 predicate places. [2025-01-10 06:58:33,817 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 199 transitions, 2471 flow [2025-01-10 06:58:33,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:58:33,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:33,817 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:33,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:58:33,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:33,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash -72811448, now seen corresponding path program 1 times [2025-01-10 06:58:33,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:33,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-01-10 06:58:33,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:33,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:33,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:33,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:33,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:33,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823264693] [2025-01-10 06:58:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823264693] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074517058] [2025-01-10 06:58:33,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:33,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:33,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:33,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:33,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:58:33,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:33,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:33,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:33,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:33,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:58:33,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:33,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:58:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074517058] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:33,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:33,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:58:33,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392552656] [2025-01-10 06:58:33,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:33,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:58:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:33,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:58:33,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:58:34,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-01-10 06:58:34,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 199 transitions, 2471 flow. Second operand has 13 states, 13 states have (on average 30.0) internal successors, (390), 13 states have internal predecessors, (390), 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:58:34,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:34,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-01-10 06:58:34,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:58:39,484 INFO L124 PetriNetUnfolderBase]: 44071/68133 cut-off events. [2025-01-10 06:58:39,484 INFO L125 PetriNetUnfolderBase]: For 289108/297317 co-relation queries the response was YES. [2025-01-10 06:58:39,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237839 conditions, 68133 events. 44071/68133 cut-off events. For 289108/297317 co-relation queries the response was YES. Maximal size of possible extension queue 3412. Compared 579191 event pairs, 2306 based on Foata normal form. 2545/70470 useless extension candidates. Maximal degree in co-relation 237799. Up to 11976 conditions per place. [2025-01-10 06:58:39,980 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 353 selfloop transitions, 138 changer transitions 2/510 dead transitions. [2025-01-10 06:58:39,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 510 transitions, 5172 flow [2025-01-10 06:58:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:58:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:58:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 871 transitions. [2025-01-10 06:58:39,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5965753424657534 [2025-01-10 06:58:39,986 INFO L175 Difference]: Start difference. First operand has 135 places, 199 transitions, 2471 flow. Second operand 20 states and 871 transitions. [2025-01-10 06:58:39,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 510 transitions, 5172 flow [2025-01-10 06:58:45,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 510 transitions, 5126 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-10 06:58:45,222 INFO L231 Difference]: Finished difference. Result has 155 places, 215 transitions, 3003 flow [2025-01-10 06:58:45,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=2382, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3003, PETRI_PLACES=155, PETRI_TRANSITIONS=215} [2025-01-10 06:58:45,223 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 98 predicate places. [2025-01-10 06:58:45,223 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 215 transitions, 3003 flow [2025-01-10 06:58:45,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 30.0) internal successors, (390), 13 states have internal predecessors, (390), 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:58:45,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:58:45,223 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:58:45,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:58:45,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:45,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-01-10 06:58:45,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:58:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash -19971288, now seen corresponding path program 1 times [2025-01-10 06:58:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:58:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-01-10 06:58:45,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:58:45,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:45,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:45,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:45,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:58:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:58:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-01-10 06:58:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165099605] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:58:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865810003] [2025-01-10 06:58:45,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:58:45,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:58:45,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:58:45,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:58:45,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:58:45,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:58:45,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:58:45,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:58:45,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:58:45,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:58:45,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:58:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:58:45,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:58:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:58:45,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865810003] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:58:45,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:58:45,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:58:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920541131] [2025-01-10 06:58:45,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:58:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:58:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:58:45,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:58:45,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:58:45,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 73 [2025-01-10 06:58:45,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 215 transitions, 3003 flow. Second operand has 12 states, 12 states have (on average 42.666666666666664) internal successors, (512), 12 states have internal predecessors, (512), 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:58:45,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:58:45,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 73 [2025-01-10 06:58:45,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand